More results on overlapping squares
نویسندگان
چکیده
منابع مشابه
More results on overlapping squares
Three recent papers [5, 11, 8] have considered in complementary ways the combinatorial consequences of assuming that three squares overlap in a string. In this paper we provide a unifying framework for these results: we show that in 12 of 14 subcases that arise the postulated occurrence of three neighbouring squares forces a breakdown into highly periodic behaviour, thus essentially trivial and...
متن کاملMore Results on Dynamic Cumulative Inaccuracy Measure
In this paper, borrowing the intuition in Rao et al. (2004), we introduce a cumulative version of the inaccuracy measure (CIM). Also we obtain interesting and applicable properties of CIM for different cases based on the residual, past and interval lifetime random variables. Relying on various applications of stochastic classes in reliability and information theory fields, we stu...
متن کاملThree Overlapping Squares: The General Case Characterized
The “Three Squares Lemma” [7] famously explored the consequences of supposing that three squares occur at the same position in a string; essentially it showed that this phenomenon could not occur unless the longest of the three squares was at least the sum of the lengths of the other two. More recently, several papers [8, 25, 17, 11] have greatly extended this result by supposing that only two ...
متن کاملMore mutually orthogonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.
متن کاملMore greedy defining sets in Latin squares
A Greedy Defining Set is a set of entries in a Latin Square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succeeds. Let g(n) be the smallest defining set for any Latin Square of order n. We give theorems on the upper bounds of gn and a table listing upper bounds of gn for small values of n. For a circulant Latin square, we find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.03.003